A GMM-Based Target Classification Scheme for a Node in Wireless Sensor Networks

نویسندگان

  • Youngsoo Kim
  • Sangbae Jeong
  • Daeyoung Kim
چکیده

In this paper, an efficient node-level target classification scheme in wireless sensor networks (WSNs) is proposed. It uses acoustic and seismic information, and its performance is verified by the classification accuracy of vehicles in a WSN. Because of the hard limitation in resources, parametric classifiers should be more preferable than non-parametric ones in WSN systems. As a parametric classifier, the Gaussian mixture model (GMM) algorithm not only shows good performances to classify targets in WSNs, but it also requires very few resources suitable to a sensor node. In addition, our sensor fusion method uses a decision tree, generated by the classification and regression tree (CART) algorithm, to improve the accuracy, so that the algorithm drives a considerable increase of the classification rate using less resources. Experimental results using a real dataset of WSN show that the proposed scheme shows a 94.10 % classification rate and outperforms the k-nearest neighbors and the support vector machine.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node

Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...

متن کامل

Target Tracking Based on Virtual Grid in Wireless Sensor Networks

One of the most important and typical application of wireless sensor networks (WSNs) is target tracking. Although target tracking, can provide benefits for large-scale WSNs and organize them into clusters but tracking a moving target in cluster-based WSNs suffers a boundary problem. The main goal of this paper was to introduce an efficient and novel mobility management protocol namely Target Tr...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design

Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...

متن کامل

Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm

Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...

متن کامل

Sink Location Service Based on Fano Plane in Wireless Sensor Networks

Sink location is considered as a basic service in geographic routing in wireless sensor networks. Obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. In this paper, a sink location algorithm based on Fano plane is proposed. The research challenge is how to ensure the intersection of two SLQ (Location Q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 91-B  شماره 

صفحات  -

تاریخ انتشار 2008